Comparison of Non-Deterministic Iterative Methods

نویسنده

  • Éric D. Taillard
چکیده

Comparing two (or more) heuristic methods based on metaheuristic principles is a difficult task that is not solved yet in a satisfactory way. Indeed these methods are iterative, meaning that the longer they run, the better the solution they produce are. They are also almost all non-deterministic, since they use a pseudo-random number generator. This means that when running twice the same heuristic method, it is possible to obtain two different solutions. There are few deterministic taboo searches (all the other metaheuristic are based on probabilistic choices), but it would be easy to make them non deterministic since they made arbitrary choices, such as the order in which neighbour solutions are examined, the neighbour solution chosen in case of equivalent evaluation, etc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Geometrical Bases for Incremental-Iterative Methods (RESEARCH NOTE)

Finding the equilibrium path by non-linear structural analysis is one of the most important subjects in structural engineering. In this way, Incremental-Iterative methods are extremely used. This paper introduces several factors in incremental steps. In addition, it suggests some control criteria for the iterative part of the non-linear analysis. These techniques are based on the geometric of e...

متن کامل

Projected non-stationary simultaneous iterative methods

In this paper, we study Projected non-stationary Simultaneous It-erative Reconstruction Techniques (P-SIRT). Based on algorithmic op-erators, convergence result are adjusted with Opial’s Theorem. The advantages of P-SIRT are demonstrated on examples taken from to-mographic imaging.

متن کامل

Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001